Allocating Students to Industry Placements Using Integer Programming and Ant Colony Optimisation

نویسندگان

چکیده

The increasing demand for work-ready students has heightened the need universities to provide work integrated learning programs enhance and reinforce students’ experiences. Students benefit most when placements meet their academic requirements graduate aspirations. Businesses community partners are more engaged they allocated that industry requirements. In this paper, both an integer programming model ant colony optimisation heuristic proposed, with aim of automating allocation placements. emphasis is on maximising student engagement partner satisfaction. As part objectives, these methods incorporate diversity in sectors undertaking multiple placements, gender equity across placement providers, provision rank selections. experimental analysis two parts: (a) we investigate how performs against manual allocations (b) scalability IP examined. results show easily outperforms previous allocations. Additionally, artificial dataset generated which similar properties original data but also includes greater numbers test algorithms. best option problem instances consisting less than 3000 students. When becomes larger, significantly time required solution, provides a useful alternative as it always able find good feasible solutions within short time-frames.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Niching for Ant Colony Optimisation

Evolutionary Computation niching methods, such as Fitness Sharing and Crowding, are aimed at simultaneously locating and maintaining multiple optima to increase search robustness, typically in multi-modal function optimization. Such methods have been shown to be useful for both single and multiple objective optimisation problems. Niching methods have been adapted in recent years for other optim...

متن کامل

RNA Secondary Structure Prediction using Ant Colony Optimisation

It is important to know the secondary structure of RNA for applications such as drug development and modelling single stranded viruses. Predictive methods have various degrees of accuracy but are significantly faster and cheaper than empirical methods such as X-ray crystallography. This project explores how Ant Colony Optimisation (ACO) performs on the task of RNA secondary structure prediction...

متن کامل

Solving a unique Shortest Path problem using Ant Colony Optimisation

Ant Colony Optimisation (ACO) has in the past proved suitable to solve many optimisation problems. This research explores the ability of the ACO algorithm to balance two quality metrics (length and cost) in its decision making process. Results are given for a preliminary investigation based on a series of shortest path problems. It is concluded that, for these problems at least, the solution qu...

متن کامل

Model Checking the Ant Colony Optimisation

We present a model for the travelling salesman problem (TSP) solved using the ant colony optimisation (ACO), a bio-inspired mechanism that helps speed up the search for a solution and that can be applied to many other problems. The natural complexity of the TSP combined with the selforganisation and emergent behaviours that result from the application of the ACO make model-checking this system ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithms

سال: 2021

ISSN: ['1999-4893']

DOI: https://doi.org/10.3390/a14080219